Partitioning of Loop-free Sperner Hypergraphs into Transversals
نویسندگان
چکیده
This article explores possibilities of partitioning the vertex set of a given simple loop-free Sperner hypergraph into a union of transversals. Studies are done on the possible number of transversals in such partitions, followed by forming a hypergraph (on the vertex set of the given hypergraph) that consists of transversals for hyperedges. AMS Subject Classification: 05C65
منابع مشابه
Identifying the Minimal Transversals of a Hypergraph and Related Problems
The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset of vertices is contained in or contains some edge of H, is shown to be co-NP-complete. A certain subproble...
متن کامل1-Sperner hypergraphs
We introduce a new class of hypergraphs, the class of 1-Sperner hypergraphs. A hypergraph H is said to be 1-Sperner if every two distinct hyperedges e, f of H satisfy min{|e \ f |, |f \ e|} = 1. We prove a decomposition theorem for 1-Sperner hypergraphs and examine several of its consequences, including bounds on the size of 1-Sperner hypergraphs and a new, constructive proof of the fact that e...
متن کاملFaster Algorithms to Enumerate Hypergraph Transversals
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph. For each fixed k ≥ 3, our algorithms for hypergraphs of rank k, where the rank is the maximum size of a hyperedge, outperform the previous best. This also implies improved upper bounds on the maximu...
متن کاملPartitions of Graphs into Coverings and Hypergraphs into Transversals
A covering of a multigraph G is a subset of edges which meet ail vertices of G. Partitions of the edges of G into coverings Ci, C2,..., Ck are considered. In particular we examine how close the cardinalities of thèse coverings may be. A resuit concerning matchings is extended to the décomposition into coverings. Finally thèse considérations are generalized to the décompositions of the vertices ...
متن کاملA New Algorithm for the Hypergraph Transversal Problem
We consider the problem of finding all minimal transversals of a hypergraph H ⊆ 2 , given by an explicit list of its hyperedges. We give a new decomposition technique for solving the problem with the following advantages: (i) Global parallelism: for certain classes of hypergraphs, e.g. hypergraphs of bounded edge size, and any given integer k, the algorithm outputs k minimal transversals of H i...
متن کامل